How to Memorize a Random 60-Bit String

نویسندگان

  • Marjan Ghazvininejad
  • Kevin Knight
چکیده

User-generated passwords tend to be memorable, but not secure. A random, computergenerated 60-bit string is much more secure. However, users cannot memorize random 60bit strings. In this paper, we investigate methods for converting arbitrary bit strings into English word sequences (both prose and poetry), and we study their memorability and other properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drill string Vibration Modeling Including Coupling Effects

Abstract: The governing equations of motion for a drill string considering coupling between axial, lateral and torsional vibrations are obtained using a Lagrangian approach. The result leads to a set of non-linear equations with time varying coefficients. A fully coupled model for axial, lateral, and torsional vibrations of drill strings is presented. The bit/formation interactions are assumed ...

متن کامل

Expanding the Length of a Pseudo-Random Number Generator

Expanding the Length of a Pseudo-Random Number Generator We now want to show how a pseudo-random number generator that only does a little bit of expansion, can be used to construct a pseudo-random generator that does a lot of expansion. The idea is that we view G(s) as consisting of “stuff” that we can spit out, together with a new seed that we feed back into the generator, etc., a polynomial n...

متن کامل

Expanding the Length of a Pseudo-Random Number Generator

Expanding the Length of a Pseudo-Random Number Generator We now want to show how a pseudo-random number generator that only does a little bit of expansion, can be used to construct a pseudo-random generator that does a lot of expansion. The idea is that we view G(s) as consisting of “stuff” that we can spit out, together with a new seed that we feed back into the generator, etc., a polynomial n...

متن کامل

Human Visual Perception and Kolmogorov Complexity: Revisited

Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probability distribution in terms of which this image is “random” (in the intuitive sense of this word), and next time, we reproduce a “random” sample from this distribution. This random sample may be different from the origin...

متن کامل

Fully Distributed Representation

A fully distributed representation based on the binary spatter code is described. It is shown how the information of a conventional record with fields is encoded into a long random bit string, or a holistic record, that has no fields, and how the fields are extracted from the holistic record. It is argued that holistic representation should be used in modeling high-level mental functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015